Nature-Inspired Techniques for Dynamic Constraint Satisfaction Problems
نویسندگان
چکیده
Combinatorial applications such as configuration, transportation and resource allocation often operate under highly dynamic unpredictable environments. In this regard, one of the main challenges is to maintain a consistent solution anytime constraints are (dynamically) added. While many solvers have been developed tackle these applications, they work idealized assumptions environmental stability. order address limitation, we propose methodology, relying on nature-inspired techniques, for solving constraint problems when added dynamically. The choice techniques motivated by fact that iterative algorithms, capable maintaining set promising solutions, at each iteration. Our methodology takes advantage two properties, follows. We first solve initial problem save final state (and related population) after obtaining solution. This saved context will then be used resume point finding, in an incremental manner, new solutions subsequent variants problem, More precisely, once found, from current search (if old no longer feasible), can seen optimization where look feasible satisfying constraints, while minimizing differences with previous sequence. latter objective ensures find least disruptive solution, very important including scheduling, planning timetabling. Following our proposed variant several problems. Constraint represented using well-known satisfaction (CSP) paradigm. Dealing additions environment expressed series static CSPs, resulting change adding constraints. sequence CSPs called CSP (DCSP). To assess performance conducted experiments randomly generated DCSP instances, following RB model. results reported discussed.
منابع مشابه
Lifting Techniques for Weighted Constraint Satisfaction Problems
In this paper, we identify rich tractable classes of Weighted Constraint Satisfaction Problems (WCSPs). Our results stem from employing a set of transformation techniques—referred to as “Lifting”—that considers each constraint locally. We show that, in general, WCSPs are reducible to minimum weighted vertex cover problems in tripartite graphs; and many tractable classes of WCSPs can be recogniz...
متن کاملStructuring Techniques for Constraint Satisfaction Problems
Rainer Weigel and Boi V. Faltings Arti cial Intelligence Laboratory Swiss Federal Institute of Technology in Lausanne (EPFL) IN-Ecublens, CH-1015 Lausanne Switzerland Abstract We present a structuring method for discrete constraint satisfaction problems (CSPs). It takes advantage of interchangeabilities to represent sets of equivalent values by meta-values and thus obtain more compact represent...
متن کاملStable Solutions for Dynamic Constraint Satisfaction Problems
An important extension of constraint technology involves problems that undergo changes that may invalidate the current solution. Previous work on dynamic problems sought methods for eeciently nding new solutions. We take a more proactive approach, exploring methods for nding solutions more likely to remain valid after changes that temporarily alter the set of valid assignments (stable solutions...
متن کاملDecomposing Constraint Satisfaction Problems Using Database Techniques
There is a very close relationship between constraint satisfaction problems and the satisfaction of join-dependencies in a relational database which is due to a common underlying structure, namely a hypergraph. By making that relationship explicit we are able to adapt techniques previously developed for the study of relational databases to obtain new results for constraint satisfaction problems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Forum
سال: 2022
ISSN: ['2662-2556']
DOI: https://doi.org/10.1007/s43069-021-00116-6